Tushar Khot
نویسنده
چکیده
Over the past years, Machine Learning (ML) approaches have taken large strides in their predictive accuracy and ease of use, resulting in ML being used in increasing number of domains. At the same time, information has grown exponentially in terms of its size and complexity. Inter-related objects (people, atoms, words, etc.) spread across multiple relations (friends, bonded, dependent, etc.) is now a common occurrence in many domains such as molecular chemistry, medical diagnosis, social networks and information extraction. To deal with noisy multi-relational data, Statistical Relational Learning (SRL) models have been proposed. Unlike most ML approaches that rely on a fixed number of features for every example, SRL models can handle an arbitrary number of features. For instance, a patient can have all their test results, where the number of tests may vary between patients, as features. But due to the increased complexity, SRL models do not scale to large domains, especially when learning the structure of the probabilistic dependencies (e.g., discovering the dependence of parents’ chromosomes on a person’s blood type). My research has mainly concentrated on developing more accurate, scalable structurelearning approaches for SRL models to make them more generally and easily applicable. Since these approaches do not rely on an expert designed model, I was able to use them in diverse domains ranging from natural language processing to medical diagnoses to network analysis.
منابع مشابه
Learning Probabilistic Logic Models with Human Advice
We consider the problem of interactive machine learning for rich, structured and noisy domains. We present a recently successful learning algorithm and provide several extensions for incorporating rich, high level, human feedback. We then discuss some open problems in this area.
متن کاملKnowledge-Based Probabilistic Logic Learning
Advice giving has been long explored in artificial intelligence to build robust learning algorithms. We consider advice giving in relational domains where the noise is systematic. The advice is provided as logical statements that are then explicitly considered by the learning algorithm at every update. Our empirical evidence proves that human advice can effectively accelerate learning in noisy ...
متن کاملGraph-based Approximate Counting for Relational Probabilistic Models
One of the key operations inside most relational probabilistic models is counting be it for parameter/structure learning or for efficient inference. However, most approaches use the logical structure for counting and do not exploit any fast counting methods. In this work-inprogress, we explore the closer connections to graph data bases and propose methods that obtain both exact and approximate ...
متن کاملAnomaly Detection in Text: The Value of Domain Knowledge
We consider the problem of detecting anomalies from text data. Our hypothesis is that as with classical anomaly detection algorithms, domain-specific features are more important than the linguistic features. We employ the use of first-order logic and demonstrate the effectiveness of useful domain knowledge in two domains. Our results show that the domain-specific features are more predictive an...
متن کاملCS 760 - Final Project Reinforcement Learning using ANN and FOIL
In this paper, we use two techniques to generalize the Q-tables in reinforcement learning. Perceptrons are useful to predict the Qvalues for unknown states but may not always be accurate. FOIL derives rules for each action but sometimes may have no rules for some states. Each approach has its advantages and in this paper, we try to compare these approaches and ways to combine these approaches t...
متن کامل